Denotational semantics for programming languages, balanced quasi-metrics and fixed points

Quasi-Metrics and Fixed Points in Computing

We consider quasi-metrics as a technical tool for use in theoretical computer science. In particular, we discuss their use in nding xed points of operators arising in programming language semantics, especially those arising in logic programming .

Denotational Semantics for Teaching Lazy Functional Programming

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, F...

Denotational Versus Declarative Semantics for Functional Programming

Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...

Chapter 24 On Relating Denotational and Operational Semantics for Programming Languages with Recursion and Concurrency

Quasi Contraction and Fixed Points

In this note, we establish and improve some results on fixed point theory in topological vector spaces. As a generalization of contraction maps, the concept of quasi contraction multivalued maps on a topological vector space will be defined. Further, it is shown that a quasi contraction and closed multivalued map on a topological vector space has a unique fixed point if it is bounded value.